The bottleneck may be the solution, not the problem.
نویسندگان
چکیده
As a highly consequential biological trait, a memory "bottleneck" cannot escape selection pressures. It must therefore co-evolve with other cognitive mechanisms rather than act as an independent constraint. Recent theory and an implemented model of language acquisition suggest that a limit on working memory may evolve to help learning. Furthermore, it need not hamper the use of language for communication.
منابع مشابه
On Bottleneck Product Rate Variation Problem with Batching
The product rate variation problem minimizes the variation in the rate at which different models of a common base product are produced on the assembly lines with the assumption of negligible switch-over cost and unit processing time for each copy of each model. The assumption of significant setup and arbitrary processing times forces the problem to be a two phase problem. The first phase determ...
متن کاملAn Efficient Approach for Bottleneck Resource(s) Detection Problem in the Multi-objective Dynamic Job Shop Environments
Nowadays energy saving is one of the crucial aspects in decisions. One of the approaches in this case is efficient use of resources in the industrial systems. Studies in real manufacturing systems indicating that one or more machines may also act as the Bottleneck Resource/ Resources (BR). On the other hand according to the Theory of Constraints (TOC), the efficient use of resources in manufact...
متن کاملA new heuristic approach to solve product mix problems in a multi-bottleneck system
Product mix problem (PMP) is one of the most important and complicated problems in production systems. Different approaches have been applied to solve this problem, among them, theory of constraints (TOC) has been widely considered since 1990s. This paper develops a distinguished algorithm to solve product mix prob-lems that is efficient both in single and multi-bottleneck problems. At first, t...
متن کاملSolving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملDetermination of the Aircraft Landing Sequence by Two Meta-Heuristic Algorithms
Due to an anticipated increase in air traffic during the next decade, air traffic control in busy airports is one of the main challenges confronting the controllers in the near future. Since the runway is often a bottleneck in an airport system, there is a great interest in optimizing the use of the runway. The most important factors in aircraft landing modeling are time and cost. For this reas...
متن کاملAn algorithm for integrated worker assignment, mixed-model two-sided assembly line balancing and bottleneck analysis
This paper addresses a multi-objective mixed-model two-sided assembly line balancing and worker assignment with bottleneck analysis when the task times are dependent on the worker’s skill. This problem is known as NP-hard class, thus, a hybrid cyclic-hierarchical algorithm is presented for solving it. The algorithm is based on Particle Swarm Optimization (PSO) and Theory of Constraints (TOC) an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Behavioral and brain sciences
دوره 39 شماره
صفحات -
تاریخ انتشار 2016